Crick Book_newfont.qxp
ثبت نشده
چکیده
منابع مشابه
Equivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata
Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick...
متن کاملOn the power of parallel communicating Watson-Crick automata systems
Parallel communicating Watson-Crick automata systems were introduced in [2] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [5], that for Watson-Crick finite automata, the complementarity relation plays no active r...
متن کاملWatson-Crick Bordered Words and their Syntactic Monoid
DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways. One of the structures that is usually undesirable f...
متن کاملQ & A
had on our lives,” she says. The Crick archive represents the biggest single acquisition the Trust has ever made. Some of the controversial Crick material on display includes documents relating to the disputes that shed light on the role of Rosalind Franklin and includes a copy of the now famous letter from Maurice Wilkins to Crick. “Our dark lady leaves us...” Wilkins wrote, referring to her t...
متن کاملRestricted deterministic Watson-Crick automata
In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic WatsonCrick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, u...
متن کامل